Modular Veriication of Multipliers

نویسندگان

  • Kavita Ravi
  • Abelardo Pardo
  • Gary D. Hachtel
  • Fabio Somenzi
چکیده

We present a new method for the eecient veriication of multipliers and other arithmetic circuits. It is based on modular arithmetic like Kimura's approach, and on composition, like Hamaguchi's approach. It diiers from both in several important respects, which make it more robust. The technique builds the residue Algebraic Decision Diagram (ADD) of as many variables as the number of outputs in the multiplier and composes the implementation circuit from the outputs to the inputs into the residue. Finally, the residue ADD is checked against the speciication.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial Formal Veri cation of Multipliers

Until recently, verifying multipliers with formal methods was not feasible, even for small input word sizes. About two years ago, a new data structure, called Multiplicative Binary Moment Diagram (*BMD), was introduced for representing arithmetic functions over Boolean variables. Based on this new data structure, methods were proposed by which veriication of multipliers with input word sizes of...

متن کامل

Universit a Di Pisa Modular Veriication of Logic Programs Modular Veriication of Logic Programs

Recentely, in Rug94, PR96] a new approach to veriication of logic and Prolog programs has been proposed, whose main advantage is the possibility to reason on diierent properties in a uniied framework. In this paper, we show an equivalent formulation of that proof method which is well-suited for modular program veriication. The notion of modularity taken into account is based on stratiication. W...

متن کامل

Modular veri cation of Argos Programs

Synchronous languages have been proposed to specify reac-tive Real-Time systems. Since such systems are used in safety critical areas , their formal veriication is crucial. For machine and human eeciency, modular veriication is advisable. For the synchronous language Argos, a Statechart variant, modular veriication means having a method compatible with parallel composition and reenement. We pre...

متن کامل

The KIV-Approach to Software Verification

This paper presents a particular approach to the design and veriication of large sequential systems. It is based on structured algebraic speciications and stepwise reenement by program modules. The approach is implemented in Kiv (Karlsruhe Interactive Veriier), and supports the entire design process starting from formal speciications and ending with veriied code. Its main characteristics are a ...

متن کامل

The Kiv - Approach to Software Veri cation ? Wolfgang

This paper presents a particular approach to the design and veriication of large sequential systems. It is based on structured algebraic speciications and stepwise reenement by program modules. The approach is implemented in Kiv (Karlsruhe Interactive Veriier), and supports the entire design process starting from formal speciications and ending with veriied code. Its main characteristics are a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996